Modeling congestion propagation in urban trans- portation networks
نویسندگان
چکیده
In urban transportation networks, research work has been focusing on alleviating the traffic congestion to optimize the network performance, such as increasing the traffic flow and decreasing the user travel time. However, studying the physical properties of traffic propagation and congestion growing has always been a difficult task, especially in a large and complex transportation network. Previous research has seen the main challenges of high complexity of modeling the traffic flow mechanism and the unpredictability of vehicle or user behaviors. The concept of maximum connected component (MCC) is recently used in analyzing the robustness and fragility of a given network structure, such as the catastrophic failure propagation of electrical blackout in a large city network. This paper studies the traffic growing and propagation in a large network based on the concept of MCC, without modeling the traffic flow mechanics. Firstly, a congestion propagation model is developed and a metric evaluating the congestion was introduced. Secondly, simulations with different parameters are developed based on the model. The results are compared with real traffic data from San Francisco network and the model is validated. It mainly shows the strong dependency of congestion among links. Finally, we show that the propagation effect is linked to the scaling law, which is a key property of the urban transportation networks.
منابع مشابه
Realistic Simulation of Urban Mesh Networks - Part I: Urban Mobility
It is a truism that simulations of mobile wireless networks (e.g., MANETs) are not realistic. There has been little effort in developing realistic mobility models and while propagation is well understood, it is rarely applied. In urban areas, the mobility of vehicles and pedestrians is greatly influenced by the environment (e.g., the location of buildings) as well as by interaction with other n...
متن کاملSmith's principle for congestion control in high-speed data networks
In high-speed communication networks, large propagation delays could have an adverse impact on the stability of feedback control algorithms. In this paper, classical control theory and Smith's principle are exploited to design an algorithm for controlling “best effort” traffic in high-speed asynchronous transfer mode (ATM) networks. The designed algorithm guarantees the stability of network que...
متن کاملOptimization-based Clustering approach of heterogeneous networks with robust network components
Unpredictability of travel behaviors and high complexity of accurate physical modeling have challenged researches to discover implicit patterns of congestion propagation and distribution in large urban networks. However, real traffic data in urban cities reveals the spatial correlation of congestion in adjacent roads and its spatiotemporal finite propagation speed. Spatial data mining and clust...
متن کاملUrban road network crisis response management: time-sensitive decision optimization
With the increasing global stock of vehicles, traffic congestion is becoming more severe and costly in many urban road networks. Road network modeling and optimization are essential tools in predicting traffic flow and reducing network congestion. Markov chains are remarkably capable in modeling complex, dynamic, and large-scale networks; Google’s PageRank algorithm is a living proof. In this a...
متن کاملA GIS-based decision support system for analysis of route choice in congested urban road networks
Urban congestion patterns have become ubiquitous and complex. Traditional, “static” approaches are no longer adequate for analyzing network flows and conducting minimum cost routing. This paper reports on a GIS-based decision support tool for modeling dynamic network congestion and conducting minimum cost routing. The system predicts network flows at a detailed level of temporal resolution, cap...
متن کامل